Superlinear Convergence and Implicit Filtering

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Superlinear Convergence and Implicit Filtering

In this note we show how the implicit filtering algorithm can be coupled with the BFGS quasi-Newton update to obtain a superlinearly convergent iteration if the noise in the objective function decays sufficiently rapidly as the optimal point is approached. We show how known theory for the noise-free case can be extended and thereby provide a partial explanation for the good performance of quasi...

متن کامل

Superlinear Convergence of Conjugate Gradients

We give a theoretical explanation for superlinear convergence behavior observed while solving large symmetric systems of equations using the conjugate gradient method or other Krylov subspace methods. We present a new bound on the relative error after n iterations. This bound is valid in an asymptotic sense when the size N of the system grows together with the number of iterations. The bound de...

متن کامل

On the Superlinear Convergence of MINRES

Quantitative bounds are presented for the superlinear convergence of the MINRES method of Paige and Saunders [SIAM J. Numer. Anal., 1975] for the solution of sparse linear systems Ax = b, with A symmetric and indefinite. It is shown that the superlinear convergence is observed as soon as the harmonic Ritz values approximate well the eigenvalues of A that are either closest to zero or farthest f...

متن کامل

Superlinear Convergence of Affine - Scalinginterior - Point

We develop and analyze a superlinearly convergent aane-scaling interior-point Newton method for innnite-dimensional problems with pointwise bounds in L p-space. The problem formulation is motivated by optimal control problems with L p-controls and pointwise control constraints. The nite-dimensional convergence theory by Coleman and Li (SIAM J. Optim., 6 (1996), pp. 418{445) makes essential use ...

متن کامل

A stabilized SQP method: superlinear convergence

Regularized and stabilized sequential quadratic programming (SQP) methods are two classes of methods designed to resolve the numerical and theoretical difficulties associated with ill-posed or degenerate nonlinear optimization problems. Recently, a stabilized SQP method has been proposed that allows convergence to points satisfying certain secondorder KKT conditions (Report CCoM 13-04, Center f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 2000

ISSN: 1052-6234,1095-7189

DOI: 10.1137/s1052623499354096